Complexity of Linear Order Computation in Performance Grammar, TAG and HPSG

نویسندگان

  • Karin Harbusch
  • Gerard Kempen
چکیده

This paper investigates the time and space complexity of word order computatio11 ill the psycholinguistically motivated grammar formalism of Performance Gramrnar (PG). In PG, the jirst stage of syntax assembly yields an u11ordered tree (inobile ') co11sisti11g of a hierarchy of lexical f rames (lexically anchored elementary trees). Associated with each lexical frame is a linearizer-a Finite-State Automaton that locally comp11tes the left-to-right order of the bra11ches of the frame. li11earizatio11 takes place after the promotion compo11ent may have raised certai11 constiwents (e.g. Whor focused phrases) into the domain of lexicnl frames lrigher uμ i1, ;h,; syntactic mobile. We show that the worst-case time a11d space complexity of a11alyzi11g input strings of length n is 0(n) and O(n'), respectively. This result compares favorably with the time complexity of word-order comp11tations in Tree Adjoi11i11g Grammar (TAG). A compariso11 with Head-Driven Phrase Structure Gra111111ar (HPSG) reveals that PG yields a more declarative linearization method, provided that the FSA is rewritte11 as an equivale11t regular expressio11. 1. Performance Grammar Perfonnance Grammar (PG; Kempen, 1999) is a psycholinguistically motivated grammar fonnalism for analysis and generation. Somewhat simplified, and in the terminology of TAGs (cf. Joshi & Schabes, 1997), PG defines Jexically anchored initial trees and generates derived trees synchronously Iinked to conceptual structures described in the same formalism (as in Synchronous TAGs; Shieber & Schabes, 1990) and it factors dorninance relationships and linear precedence in surface structure trees (Joshi, 1987). PG differs from recent TAG versions in that there are no auxiliary trees, and that adjunction is replaced by a combination of substitution-the Gerard Kempen Dept. of Psychology, Leiden Univ. PO Box 9555, NL-2300 RB Leiden/NL [email protected] only composition operation-and finite-state linearizers that take caie of V\!ttic.:il rr:ovement ('promotion') of phrases and of the linear order of branches of deri ved trees. s su~o· 1 1 1 1 N p 1 s, AD V p 1PP1 s

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adapting HPSG-to-TAG compilation to wide-coverage grammars

The HPSG-to-TAG compilation algorithm proposed in (Kasper et al., 1995) has been the basis of large scale experiments in VerbMobil, a speech–to–speech dialouge translation system in the scheduling and travel domain. The results here refer to the English HPSG grammar developed at CSLI. Several non-trivial theoretical problems have been discovered by the practical application of this algorithm. T...

متن کامل

A Formal Proof of Strong Equivalence for a Grammar Conversion from LTAG to HPSG-style

This paper presents a sketch of a formal proof of strong equivalence,1 where both grammars generate equivalent parse results, between any LTAG (Lexicalized Tree Adjoining Grammar: Schabes, Abeille and Joshi (1988)) G and an HPSG (Head-Driven Phrase Structure Grammar: Pollard and Sag (1994))-style grammar converted from G by a grammar conversion (Yoshinaga and Miyao, 2001). Our proof theoretical...

متن کامل

Long Transformations in TAG and HPSG

There has been a good deal of work examining the relationship between Tree Adjoining Grammar and HPSG. As shown by [5], it is possible to “compile” many HPSG analyses into the TAG framework. In this work I focus on some restructuring constructions in Romance that have received an argument composition analysis in HPSG. A TAG analysis of these constructions must take a different approach and a co...

متن کامل

Translating the XTAG English grammar to HPSG

We describe the development of XHPSG, a large-scale English grammar in the HPSG formalism translated from the XTAG grammar (The XTAG Research Group, 1995). Our goal is to obtain a large-scale, linguistically sound grammar for our HPSG parser (Makino et al., 1998) with a relatively small workload. For this purpose, we try to make an HPSG grammar equivalent to the XTAG grammar in the strong sense...

متن کامل

Constraint-Based Computational Semantics: A Comparison between LTAG and LRS

This paper compares two approaches to computational semantics, namely semantic unification in Lexicalized Tree Adjoining Grammars (LTAG) and Lexical Resource Semantics (LRS) in HPSG. There are striking similarities between the frameworks that make them comparable in many respects. We will exemplify the differences and similarities by looking at several phenomena. We will show, first of all, tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000